Sciweavers

654 search results - page 62 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
WSCG
2003
177views more  WSCG 2003»
13 years 10 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein
ICNP
2007
IEEE
14 years 3 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 9 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
CVIU
2008
180views more  CVIU 2008»
13 years 9 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
MOBICOM
2006
ACM
14 years 2 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff