Sciweavers

446 search results - page 23 / 90
» A Combinatorial Theorem for Trees
Sort
View
107
Voted
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
15 years 7 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 5 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
15 years 1 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
148
Voted
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 8 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
AAAI
2000
15 years 3 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri