Sciweavers

334 search results - page 31 / 67
» Improved Algorithms and Complexity Results for Power Dominat...
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
LATIN
2010
Springer
14 years 2 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
ECCC
2011
205views ECommerce» more  ECCC 2011»
13 years 2 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
14 years 1 months ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
14 years 4 months ago
Applying Resource Sharing Algorithms to ADL-driven Automatic ASIP Implementation
Presently, Architecture Description Languages (ADLs) are widely used to raise the abstraction level of the design space exploration of Application Specific Instruction-set Proces...
Ernst Martin Witte, Anupam Chattopadhyay, Oliver S...