2031 search results - page 379 / 407 » On Tree-Constrained Matchings and Generalizations |
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
ICFP
2003
ACM
14 years 9 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
MOBISYS
2008
ACM
14 years 9 months ago
2008
ACM
Over the course of a day a human interacts with tens or hundreds of individual objects. Many of these articles are nomadic, relying on human memory to manually index, inventory, o...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...