Sciweavers

8413 search results - page 95 / 1683
» Ordering Problem Subgoals
Sort
View
CN
1998
54views more  CN 1998»
13 years 7 months ago
Efficient Crawling Through URL Ordering
In this paper we study in what order a crawler should visit the URLs it has seen, in order to obtain more "important" pages first. Obtaining important pages rapidly can ...
Junghoo Cho, Hector Garcia-Molina, Lawrence Page
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
CVPR
2006
IEEE
14 years 10 months ago
Model Order Selection and Cue Combination for Image Segmentation
Model order selection and cue combination are both difficult open problems in the area of clustering. In this work we build upon stability-based approaches to develop a new method...
Andrew Rabinovich, Serge Belongie, Tilman Lange, J...
ICML
2009
IEEE
14 years 9 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
Brian McFee, Gert R. G. Lanckriet
JUCS
2010
105views more  JUCS 2010»
13 years 6 months ago
Ordered Catenation Closures and Decompositions of Languages Related to a Language of Derick Wood
: We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation...
Arto Salomaa