Sciweavers

607 search results - page 35 / 122
» Unifying Exact Completions
Sort
View
104
Voted
NETWORKS
2011
14 years 5 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
HICSS
2008
IEEE
104views Biometrics» more  HICSS 2008»
15 years 5 months ago
Document Retrieval Using Proximity-Based Phrase Searching
Exact phrase matching is a powerful tool to quickly retrieve results when a sufficient section of the text is accurately provided as the query. If the section of the text is not c...
Kathryn Patterson, Carolyn R. Watters, Michael A. ...
GECCO
2005
Springer
15 years 4 months ago
A theoretical analysis of the HIFF problem
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
Nicholas Freitag McPhee, Ellery Fussell Crane
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
15 years 4 months ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
89
Voted
EXACT
2008
15 years 1 months ago
Deriving Explanations From Partial Temporal Information
The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human think...
Jixin Ma, Brian Knight, Miltos Petridis