咨询与建议

限定检索结果

文献类型

  • 40 篇 期刊文献
  • 16 篇 会议

馆藏范围

  • 56 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 43 篇 工学
    • 35 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 3 篇 生物工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 动力工程及工程热...
    • 2 篇 电气工程
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 控制科学与工程
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 船舶与海洋工程
    • 1 篇 航空宇航科学与技...
  • 31 篇 理学
    • 28 篇 数学
    • 4 篇 生物学
    • 2 篇 统计学(可授理学、...
  • 5 篇 管理学
    • 5 篇 管理科学与工程(可...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 56 篇 enumeration algo...
  • 5 篇 maximal cliques
  • 4 篇 polynomial delay
  • 3 篇 space efficiency
  • 3 篇 network mining a...
  • 2 篇 exact exponentia...
  • 2 篇 reverse search
  • 2 篇 query evaluation
  • 2 篇 dense subgraphs
  • 2 篇 community detect...
  • 2 篇 k-degenerate gra...
  • 2 篇 chain subgraph c...
  • 2 篇 combinatorial bo...
  • 2 篇 parameterized co...
  • 1 篇 triangle-free gr...
  • 1 篇 irredundant sets
  • 1 篇 genetic algorith...
  • 1 篇 f-fcsr-h v2
  • 1 篇 numerical algori...
  • 1 篇 monotone propert...

机构

  • 3 篇 natl inst inform...
  • 2 篇 lunghwa univ sci...
  • 2 篇 univ pisa pisa
  • 2 篇 natl taipei coll...
  • 2 篇 millennium inst ...
  • 2 篇 univ clermont au...
  • 2 篇 max planck inst ...
  • 2 篇 luiss univ rome
  • 2 篇 pontificia univ ...
  • 1 篇 samsung r&d ctr ...
  • 1 篇 univ lyon 1 univ...
  • 1 篇 univ norte barra...
  • 1 篇 politecn milan d...
  • 1 篇 univ toulouse in...
  • 1 篇 department of ci...
  • 1 篇 univ memphis dep...
  • 1 篇 btu cottbus senf...
  • 1 篇 univ firenze flo...
  • 1 篇 kyushu univ dept...
  • 1 篇 univ paris 06 eq...

作者

  • 5 篇 conte alessio
  • 5 篇 sinaimeri blerin...
  • 4 篇 sagot marie-fran...
  • 4 篇 marino andrea
  • 3 篇 nourine lhouari
  • 3 篇 uno takeaki
  • 3 篇 mary arnaud
  • 3 篇 grossi roberto
  • 3 篇 versari luca
  • 3 篇 calamoneri tizia...
  • 2 篇 elbassioni khale...
  • 2 篇 kante mamadou mo...
  • 2 篇 gastaldello matt...
  • 2 篇 yamanaka katsuhi...
  • 2 篇 wu ro-yu
  • 2 篇 rauf imran
  • 2 篇 wasa kunihiro
  • 2 篇 chang jou-ming
  • 2 篇 riveros cristian
  • 1 篇 soleimanfallah a...

语言

  • 47 篇 英文
  • 8 篇 其他
检索条件"主题词=Enumeration algorithms"
56 条 记 录,以下是11-20 订阅
Efficient enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs  18th
Efficient Enumeration of Drawings and Combinatorial Structur...
收藏 引用
18th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Da Lozzo, Giordano Di Battista, Giuseppe Frati, Fabrizio Grosso, Fabrizio Patrignani, Maurizio Roma Tre Univ Rome Italy
We propose efficient algorithms for enumerating the celebrated combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix... 详细信息
来源: 评论
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked enumeration  21
Probabilistic Databases under Updates: Boolean Query Evaluat...
收藏 引用
40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)
作者: Berkholz, Christoph Merz, Maximilian Humboldt Univ Inst Informat Berlin Germany
We consider tuple-independent probabilistic databases in a dynamic setting, where tuples can be inserted or deleted. In this context we are interested in efficient data structures for maintaining the query result of B... 详细信息
来源: 评论
enumeration and Updates for Conjunctive Linear Algebra Queries Through Expressibility  27
Enumeration and Updates for Conjunctive Linear Algebra Queri...
收藏 引用
27th International Conference on Database Theory (ICDT)
作者: Serrano, Thomas Munoz Riveros, Cristian Vansummeren, Stijn UHasselt Data Sci Inst Diepenbeek Belgium Pontificia Univ Catolica Chile Santiago Chile Millennium Inst Fdn Res Data Santiago Chile
Due to the importance of linear algebra and matrix operations in data analytics, there is significant interest in using relational query optimization and processing techniques for evaluating (sparse) linear programs. ... 详细信息
来源: 评论
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques  43
Sublinear-space bounded-delay enumeration for massive networ...
收藏 引用
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
作者: Conte, Alessio Grossi, Roberto Marino, Andrea Versari, Luca Dipartimento di Informatica Università di Pisa Pisa Italy Scuola Normale Superiore Pisa Italy
Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in ne... 详细信息
来源: 评论
An output sensitive algorithm for maximal clique enumeration in sparse graphs  12
An output sensitive algorithm for maximal clique enumeration...
收藏 引用
12th International Symposium on Parameterized and Exact Computation, IPEC 2017
作者: Manoussakis, George LRI-CNRS Université Paris Sud Université Paris Saclay France
The degeneracy of a graph G is the smallest integer k such that every subgraph of G contains a vertex of degree at most k. Given an n-order k-degenerate graph G, we present an algorithm for enumerating all its maximal... 详细信息
来源: 评论
Amortized efficiency of generating planar paths in convex position
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第35期412卷 4504-4512页
作者: Wu, Ro-Yu Chang, Jou-Ming Pai, Kung-Jui Wang, Yue-Li Natl Taipei Coll Business Inst Informat & Decis Sci Taipei Taiwan Lunghwa Univ Sci & Technol Dept Ind Management Tao Yuan Taiwan Mingchi Univ Technol Dept Ind Engn & Management Taipei Taiwan Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei Taiwan
Let S be a set of n >= 3 points arranged in convex position in the plane and suppose that all points of S are labeled from I to n in clockwise direction. A planar path P on S is a path whose edges connect all point... 详细信息
来源: 评论
Computing Phylo-k-Mers
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2023年 第5期20卷 2889-2897页
作者: Romashchenko, Nikolai Linard, Benjamin Rivals, Eric Pardi, Fabio Univ Montpellier LIRMM CNRS F-34095 Montpellier France Univ Toulouse INRAE UR MIAT F-31320 Castanet Tolosan France
Finding the correct position of new sequences within an established phylogenetic tree is an increasingly relevant problem in evolutionary bioinformatics and metagenomics. Recently, alignment-free approaches for this t... 详细信息
来源: 评论
Maximal strongly connected cliques in directed graphs: algorithms and bounds
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 303卷 237-252页
作者: Conte, Alessio Kante, Mamadou Moustapha Uno, Takeaki Wasa, Kunihiro Univ Pisa Pisa Italy Univ Clermont Auvergne CNRS LIMOS Aubiere France Natl Inst Informat Tokyo Japan
Finding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and m... 详细信息
来源: 评论
A note on systems with max-min and max-product constraints
收藏 引用
FUZZY SETS AND SYSTEMS 2008年 第17期159卷 2272-2277页
作者: Elbassioni, Khaled A. Max Planck Inst Informat Saarbrucken Germany
We consider a system A o x >= b, where A is an element of R-+(mxn) is a non-negative matrix and b is an element of R-+(m) is a non-negative vector over the n-dimensional variable l <= x <= u, where l, u is an... 详细信息
来源: 评论
Simultaneous Solution of Lagrangean Dual Problems Interleaved with Preprocessing for the Weight Constrained Shortest Path Problem
收藏 引用
NETWORKS 2009年 第4期53卷 358-381页
作者: Muhandiramge, Ranga Boland, Natashia Univ Newcastle Sch Math & Phys Sci Callaghan NSW 2308 Australia Univ Western Australia Sch Math & Stat Crawley WA 6009 Australia
Conventional Lagrangean preprocessing for the network Weight Constrained Shortest Path Problem (WCSPP), for example Beasley and Christofides (Beasley and Christofides, Networks 19 (1989)9 379-394), calculates lower bo... 详细信息
来源: 评论