Sciweavers

117 search results - page 21 / 24
» On the directed Full Degree Spanning Tree problem
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
15 years 9 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
JCDL
2004
ACM
128views Education» more  JCDL 2004»
15 years 2 months ago
Panorama: extending digital libraries with topical crawlers
A large amount of research, technical and professional documents are available today in digital formats. Digital libraries are created to facilitate search and retrieval of inform...
Gautam Pant, Kostas Tsioutsiouliklis, Judy Johnson...
CVPR
2008
IEEE
15 years 11 months ago
Least squares surface reconstruction from measured gradient fields
This paper presents a new method for the reconstruction of a surface from its ? and ? gradient field, measured, for example, via Photometric Stereo. The new algorithm produces the...
Matthew Harker, Paul O'Leary