7197 search results - page 395 / 1440 » On the computational power of BlenX |
198
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
178
click to vote
CONCURRENCY
2004
15 years 6 months ago
2004
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
213
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
175
click to vote
ECCC
1998
15 years 6 months ago
1998
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
207
click to vote
IEEEHPCS
2010
15 years 5 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...