7106 search results - page 1251 / 1422 » Restricted Complexity, General Complexity |
129
Voted
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
191
click to vote
MOBIHOC
2004
ACM
16 years 4 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
175
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
151
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
132
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...