Sciweavers

929 search results - page 166 / 186
» On Computation and Communication with Small Bias
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 1 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
BROADNETS
2006
IEEE
14 years 12 days ago
Efficient Integration of Web Services in Ambient-aware Sensor Network Applications
Sensor webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles ...
Isaac Amundson, Manish Kushwaha, Xenofon D. Koutso...
CONEXT
2008
ACM
13 years 10 months ago
Observing slow crustal movement in residential user traffic
It is often argued that rapidly increasing video content along with the penetration of high-speed access is leading to explosive growth in the Internet traffic. Contrary to this p...
Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, Akira ...
IAAI
2003
13 years 10 months ago
A Cellular Telephone-Based Application for Skin-Grading to Support Cosmetic Sales
We have developed a sales support system for door-todoor sales of cosmetics based on a skin-image grading system called Skin-CRM (Skin Customer Relationship Management). Our Skin-...
Hironori Hiraishi, Fumio Mizoguchi
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...