Sciweavers

2100 search results - page 198 / 420
» Fundamentals of the problem
Sort
View
131
Voted
JACM
2012
13 years 3 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
108
Voted
IOR
2007
106views more  IOR 2007»
15 years 20 days ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
140
Voted
CVPR
2009
IEEE
16 years 7 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
CBSE
2005
Springer
15 years 6 months ago
Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
Naiyana Tansalarak, Kajal T. Claypool
BIOCOMP
2007
15 years 2 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci