Sciweavers

1040 search results - page 201 / 208
» Rounding algorithms for covering problems
Sort
View
MM
2006
ACM
178views Multimedia» more  MM 2006»
14 years 2 months ago
Multimedia signal processing for behavioral quantification in neuroscience
While there have been great advances in quantification of the genotype of organisms, including full genomes for many species, the quantification of phenotype is at a comparatively...
Peter Andrews, Haibin Wang, Dan Valente, Jih&egrav...
VISUALIZATION
2005
IEEE
14 years 2 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
TABLEAUX
2005
Springer
14 years 2 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
FSR
2003
Springer
251views Robotics» more  FSR 2003»
14 years 1 months ago
Distributed Search and Rescue with Robot and Sensor Teams
We develop a network of distributed mobile sensor systems as a solution to the emergency response problem. The mobile sensors are inside a building and they form a connected ad-ho...
George Kantor, Sanjiv Singh, Ronald A. Peterson, D...