Sciweavers

943 search results - page 89 / 189
» How should data structures and algorithms be taught
Sort
View
129
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 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
128
Voted
ISCI
2008
117views more  ISCI 2008»
15 years 2 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
122
Voted
SIGGRAPH
1994
ACM
15 years 6 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
146
Voted
SRDS
2010
IEEE
15 years 14 days 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
135
Voted
GLOBECOM
2007
IEEE
15 years 9 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