Sciweavers

1350 search results - page 257 / 270
» Efficiently searching for similar images
Sort
View
ITSL
2008
13 years 9 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
SBBD
2008
256views Database» more  SBBD 2008»
13 years 9 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
BMCBI
2007
149views more  BMCBI 2007»
13 years 7 months ago
SAMPI: Protein Identification with Mass Spectra Alignments
Background: Mass spectrometry based peptide mass fingerprints (PMFs) offer a fast, efficient, and robust method for protein identification. A protein is digested (usually by tryps...
Hans-Michael Kaltenbach, Andreas Wilke, Sebastian ...
IJCAI
2001
13 years 9 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson