Sciweavers

1550 search results - page 104 / 310
» Optimizing search by showing results in context
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...
RECOMB
2003
Springer
14 years 9 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
ENTCS
2007
190views more  ENTCS 2007»
13 years 8 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
COMPGEOM
1995
ACM
14 years 24 days ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee