Sciweavers

76 search results - page 12 / 16
» Import is Not Inheritance - Why We Need Both: Modules and Cl...
Sort
View
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
14 years 8 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...
SPAA
1996
ACM
13 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
EDBT
2011
ACM
209views Database» more  EDBT 2011»
12 years 11 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
14 years 1 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 9 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin