9842 search results - page 1677 / 1969 » The Complexity of the Matching-Cut Problem |
157
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
247
Voted
AGP
2010
IEEE
15 years 9 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
117
Voted
PODS
2010
ACM
15 years 9 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
158
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
149
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...