Sciweavers

417 search results - page 77 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
14 years 9 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
MM
2003
ACM
160views Multimedia» more  MM 2003»
15 years 2 months ago
VideoQA: question answering on news video
When querying a news video archive, the users are interested in retrieving precise answers in the form of a summary that best answers the query. However, current video retrieval s...
Hui Yang, Lekha Chaisorn, Yunlong Zhao, Shi-Yong N...
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
14 years 10 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
TASE
2008
IEEE
14 years 9 months ago
Randomized Optimal Design of Parallel Manipulators
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
Yunjiang Lou, Guanfeng Liu, Zexiang Li
99
Voted
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello