3946 search results - page 726 / 790 » The computational complexity of choice sets |
181
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
183
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—While it is a well known result that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...
189
click to vote
SIBGRAPI
2008
IEEE
16 years 23 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
190
click to vote
INFOCOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
151
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...