Sciweavers

6315 search results - page 978 / 1263
» Approximating Solution Structure
Sort
View
VLDB
2007
ACM
147views Database» more  VLDB 2007»
16 years 5 months ago
A General Framework for Modeling and Processing Optimization Queries
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
Michael Gibas, Ning Zheng, Hakan Ferhatosmanoglu
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
16 years 5 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
PLDI
2010
ACM
16 years 2 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
CVPR
2010
IEEE
16 years 12 days ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
CHI
2010
ACM
15 years 11 months ago
NiCEBook: supporting natural note taking
In this paper, we present NiCEBook, a paper notebook that supports taking, structuring and reusing notes. Through a study of note-taking habits, we observed that different strateg...
Peter Brandl, Christoph Richter, Michael Haller