Sciweavers

973 search results - page 182 / 195
» New Bounds on Crossing Numbers
Sort
View
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 8 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 9 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
VLDB
2005
ACM
397views Database» more  VLDB 2005»
14 years 8 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
14 years 8 months ago
Multi-tenant databases for software as a service: schema-mapping techniques
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
Stefan Aulbach, Torsten Grust, Dean Jacobs, Alfons...