Sciweavers

403 search results - page 27 / 81
» Flexible Data Searchs using Condition Formulas
Sort
View
VLSID
2005
IEEE
97views VLSI» more  VLSID 2005»
15 years 3 months ago
Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
Kameshwar Chandrasekar, Michael S. Hsiao
ICDT
2009
ACM
130views Database» more  ICDT 2009»
15 years 10 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
GECCO
2005
Springer
15 years 3 months ago
Predicting healthcare costs using GAs
Predicting prospective healthcare costs is of increasing importance. Genetic search is used to discover attribute sets and associated posterior probability classifiers that predi...
Christopher R. Stephens, Henri Waelbroeck, S. Tall...
WWW
2006
ACM
15 years 10 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy