Sciweavers

711 search results - page 137 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
CIKM
2009
Springer
14 years 2 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
BMCBI
2008
200views more  BMCBI 2008»
13 years 7 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan