Sciweavers

4781 search results - page 44 / 957
» Complexity at large
Sort
View
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
CVPR
2005
IEEE
13 years 9 months ago
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
Bogdan Georgescu, Xiang Sean Zhou, Dorin Comaniciu...
BICOB
2009
Springer
14 years 2 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 7 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...