Sciweavers

628 search results - page 27 / 126
» Magic Counting Methods
Sort
View
OPODIS
2004
13 years 9 months ago
Self-tuning Reactive Distributed Trees for Counting and Balancing
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
Phuong Hoai Ha, Marina Papatriantafilou, Philippas...
VLDB
2008
ACM
140views Database» more  VLDB 2008»
14 years 8 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
GLVLSI
1999
IEEE
105views VLSI» more  GLVLSI 1999»
14 years 7 days ago
Area-Efficient Area Pad Design for High Pin-Count Chips
This paper presents an area pad layout method to e ciently reduce the space required for interconnection pads and pad drivers. Unlike peripheral pads, area pads use only the top m...
Louis Luh, John Choma Jr., Jeffrey T. Draper
EJC
2006
13 years 8 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
JSC
2006
102views more  JSC 2006»
13 years 8 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards