Sciweavers

2080 search results - page 53 / 416
» Collections, Cardinalities, and Relations
Sort
View
VLDB
2003
ACM
125views Database» more  VLDB 2003»
16 years 6 months ago
THESUS: Organizing Web document collections based on link semantics
Abstract. The requirements for effective search and management of the WWW are stronger than ever. Currently Web documents are classified based on their content not taking into acco...
Maria Halkidi, Benjamin Nguyen, Iraklis Varlamis, ...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 3 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 8 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 7 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 11 months ago
A Bernoulli Relational Model for Nonlinear Embedding
The notion of relations is extremely important in mathematics. In this paper, we use relations to describe the embedding problem and propose a novel stochastic relational model fo...
Gang Wang, Hui Zhang, Zhihua Zhang, Frederick H. L...