Sciweavers

943 search results - page 89 / 189
» How should data structures and algorithms be taught
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ISCI
2008
117views more  ISCI 2008»
14 years 9 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao
SIGGRAPH
1994
ACM
15 years 1 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
SRDS
2010
IEEE
14 years 7 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
GLOBECOM
2007
IEEE
15 years 4 months ago
Admission Control for Multimedia Delivery Over Deadline-Based Networks
—Increasing demand to transmit real-time data over packet-switched networks calls for quality-of-service support from the underlying network. Deadline-based networks were develop...
Yanni Ellen Liu, Jie Wu