Sciweavers

1047 search results - page 181 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
DAM
2010
112views more  DAM 2010»
13 years 7 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
ECCV
2004
Springer
14 years 9 months ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
CIKM
2006
Springer
13 years 11 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
SIGIR
2008
ACM
13 years 7 months ago
Comments-oriented document summarization: understanding documents with readers' feedback
Comments left by readers on Web documents contain valuable information that can be utilized in different information retrieval tasks including document search, visualization, and ...
Meishan Hu, Aixin Sun, Ee-Peng Lim
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
14 years 9 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial