Sciweavers

3663 search results - page 402 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2005
Springer
16 years 9 days ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
149
Voted
ICALP
2005
Springer
16 years 9 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ICALP
2004
Springer
16 years 5 days ago
Algorithms for Multi-product Pricing
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
173
Voted
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 11 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
FOSSACS
1998
Springer
15 years 11 months ago
Generalizing Domain Theory
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
Michael W. Mislove