Sciweavers

6365 search results - page 1217 / 1273
» Fast Local Computation Algorithms
Sort
View
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
16 years 1 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
113
Voted
MOBIHOC
2008
ACM
16 years 5 days ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
CVPR
2010
IEEE
15 years 9 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
ASSETS
2009
ACM
15 years 7 months ago
Instant tactile-audio map: enabling access to digital maps for people with visual impairment
In this paper, we propose an automatic approach, complete with a prototype system, for supporting instant access to maps for local navigation by people with visual impairment. The...
Zheshen Wang, Baoxin Li, Terri Hedgpeth, Teresa Ha...
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 6 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley
« Prev « First page 1217 / 1273 Last » Next »