Sciweavers

2989 search results - page 197 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
TSP
2008
100views more  TSP 2008»
15 years 2 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 25 days ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
AGTIVE
2007
Springer
15 years 6 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
ANCS
2006
ACM
15 years 6 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
182
Voted
RECOMB
2001
Springer
16 years 2 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa