Sciweavers

7930 search results - page 371 / 1586
» Greedy in Approximation Algorithms
Sort
View
ADHOC
2007
108views more  ADHOC 2007»
15 years 6 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
COR
2008
88views more  COR 2008»
15 years 6 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
JCB
2008
102views more  JCB 2008»
15 years 6 months ago
DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications
Accurately reconstructing the large-scale gene order in an ancestral genome is a critical step to better understand genome evolution. In this paper, we propose a heuristic algorit...
Jian Ma, Aakrosh Ratan, Brian J. Raney, Bernard B....
JAIR
2006
128views more  JAIR 2006»
15 years 6 months ago
Cognitive Principles in Robust Multimodal Interpretation
Multimodal conversational interfaces provide a natural means for users to communicate with computer systems through multiple modalities such as speech and gesture. To build effect...
Joyce Yue Chai, Zahar Prasov, Shaolin Qu
IVC
1998
65views more  IVC 1998»
15 years 6 months ago
Segmentation of MR images with intensity inhomogeneities
A statistical model to segment clinical magnetic resonance (MR) images in the presence of noise and intensity inhomogeneities is proposed. Inhomogeneities are considered to be mul...
Jagath C. Rajapakse, Frithjof Kruggel