Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TMC
2012
10 years 4 months ago
Trajectory-Based Statistical Forwarding for Multihop Infrastructure-to-Vehicle Data Delivery
—This paper proposes Trajectory-based Statistical Forwarding (TSF) scheme, tailored for the multihop data delivery from infrastructure nodes (e.g., Internet access points) to mov...
Jaehoon (Paul) Jeong, Shuo Guo, Yu (Jason) Gu, Tia...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
11 years 8 months ago
Controllability of homogeneous single-leader networks
This paper addresses an aspect of controllability in a single-leader network when the agents are homogeneous. In such a network, indices are not assigned to the individual agents a...
Philip Twu, Magnus Egerstedt, Simone Martini
ECRTS
2009
IEEE
11 years 11 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler
TSMC
2002
124views more  TSMC 2002»
12 years 1 months ago
Binocular transfer methods for point-feature tracking of image sequences
Image transfer is a method for projecting a 3D scene from two or more reference images. Typically, the correspondences of target points to be transferred and the reference points m...
Jason Z. Zhang, Q. M. Jonathan Wu, Hung-Tat Tsui, ...
TKDE
2002
124views more  TKDE 2002»
12 years 1 months ago
Clustering for Approximate Similarity Search in High-Dimensional Spaces
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
Chen Li, Edward Y. Chang, Hector Garcia-Molina, Gi...
DAM
1999
137views more  DAM 1999»
12 years 1 months ago
How to Find a Point on a Line Within a Fixed Distance
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
Christoph A. Hipke, Christian Icking, Rolf Klein, ...
AHSWN
2010
177views more  AHSWN 2010»
12 years 1 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
CCCG
2001
12 years 3 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
APPROX
2008
Springer
95views Algorithms» more  APPROX 2008»
12 years 3 months ago
Sweeping Points
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...
Adrian Dumitrescu, Minghui Jiang
ISWC
2005
IEEE
12 years 7 months ago
Pictorial Depth Cues for Outdoor Augmented Reality
This paper presents and evaluates a set of pictorial depth cues for far-field outdoor mobile augmented reality (AR). We examine the problem of accurately placing virtual annotatio...
Jason Wither, Tobias Höllerer
books