2095 search results - page 46 / 419 » Improved pebbling bounds |
ESA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
CN
2006
13 years 10 months ago
2006
Expedited Forwarding (EF) is a service defined under the Differentiated Services framework. Based on its recently revised definition in IETF RFC 3246, Packet Scale Rate Guarantee ...
UAI
2008
13 years 11 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
MST
2008
13 years 9 months ago
2008
We study finite bisimulations of dynamical systems in Rn defined by Pfaffian maps. The pure existence of finite bisimulations for a more general class of o-minimal systems was show...