3008 search results - page 252 / 602 » Independence in connected graphs |
151
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
181
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
156
click to vote
SIGMETRICS
2005
ACM
16 years 6 days ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
195
click to vote
FPL
2007
Springer
15 years 10 months ago
2007
Springer
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
172
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...