4679 search results - page 425 / 936 » Modeling When Connections Are the Problem |
191
click to vote
COMCOM
2004
15 years 6 months ago
2004
Storage, memory, processor, and communications bandwidth are all relatively plentiful and inexpensive. However, a growing expense in the operation of computer networks is electric...
173
click to vote
IJCM
2010
15 years 5 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
180
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Much research has been devoted to maximize the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery...
182
click to vote
PVLDB
2010
15 years 5 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
328
click to vote
PVLDB
2011
15 years 1 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...