Sciweavers

88 search results - page 12 / 18
» On the Complexity of Matroid Isomorphism Problem
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
13 years 3 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 29 days ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 8 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 10 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...