Sciweavers

4865 search results - page 140 / 973
» The Complexity of Graph Connectivity
Sort
View
IUI
2009
ACM
14 years 5 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran
ECSQARU
2009
Springer
14 years 5 months ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Vasiliki Efstathiou, Anthony Hunter
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
14 years 4 months ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 10 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen