Sciweavers

26354 search results - page 5038 / 5271
» How we refactor, and how we know it
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 3 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 3 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
VIS
2004
IEEE
134views Visualization» more  VIS 2004»
16 years 3 months ago
Projecting Tetrahedra without Rendering Artifacts
Hardware-accelerated direct volume rendering of unstructured volumetric meshes is often based on tetrahedral cell projection, in particular, the Projected Tetrahedra (PT) algorith...
David S. Ebert, Martin Kraus, Wei Qiao
GIS
2009
ACM
16 years 3 months ago
An Interactive Approach to Route Search
A route leads from a start location to a final destination and passes through geospatial entities that are picked according to search terms provided by the user. Each entity is pe...
Yaron Kanza, Roy Levin, Eliyahu Safra, Yehoshua Sa...
DAC
2009
ACM
16 years 2 months ago
Multicore parallel min-cost flow algorithm for CAD applications
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
Yinghai Lu, Hai Zhou, Li Shang, Xuan Zeng
« Prev « First page 5038 / 5271 Last » Next »