Sciweavers

785 search results - page 118 / 157
» An Algebra of Hierarchical Graphs
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 10 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
VLSID
2002
IEEE
172views VLSI» more  VLSID 2002»
14 years 10 months ago
Improvement of ASIC Design Processes
With device counts on modern-day ASICs crossing the 10 million mark, careful planning of an ASIC design project is necessary to meet time deadlines. Two problems arise in this con...
Vineet Sahula, C. P. Ravikumar, D. Nagchoudhuri
WISE
2009
Springer
14 years 7 months ago
Formal Identification of Right-Grained Services for Service-Oriented Modeling
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Yukyong Kim, Kyung-Goo Doh
IWSOS
2007
Springer
14 years 4 months ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui