Sciweavers

6300 search results - page 1099 / 1260
» We have it easy, but do we have it right
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 1 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
MOBIHOC
2008
ACM
16 years 29 days ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ATAL
2009
Springer
15 years 8 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...
ATAL
2009
Springer
15 years 8 months ago
Learning equilibria in repeated congestion games
While the class of congestion games has been thoroughly studied in the multi-agent systems literature, settings with incomplete information have received relatively little attenti...
Moshe Tennenholtz, Aviv Zohar
« Prev « First page 1099 / 1260 Last » Next »