Sciweavers

3471 search results - page 290 / 695
» Obstacle Numbers of Graphs
Sort
View
IR
2008
15 years 6 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 6 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
TMC
2008
112views more  TMC 2008»
15 years 6 months ago
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
Sensor deployment is a critical issue because it affects the cost and detection capability of a wireless sensor network. In this work, we consider two related deployment problems: ...
You-Chiun Wang, Chun-Chi Hu, Yu-Chee Tseng
BIOINFORMATICS
2004
99views more  BIOINFORMATICS 2004»
15 years 6 months ago
EST clustering error evaluation and correction
Motivation: The gene expression intensity information conveyed by (EST) Expressed Sequence Tag data can be used to infer important cDNA library properties, such as gene number and...
Ji-Ping Z. Wang, Bruce G. Lindsay 0002, James Leeb...
COMGEO
1998
ACM
15 years 6 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas