Sciweavers

2601 search results - page 285 / 521
» A Point in Many Triangles
Sort
View
IWPEC
2010
Springer
15 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
SECON
2010
IEEE
15 years 4 months ago
SAND: Sectored-Antenna Neighbor Discovery Protocol for Wireless Networks
Abstract--Directional antennas offer many potential advantages for wireless networks such as increased network capacity, extended transmission range and reduced energy consumption....
Emad Felemban, Robert Murawski, Eylem Ekici, Sangj...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 4 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
221
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
Some Notes on Models and Modelling
Analytical models are a fundamental tool in the development of computer-based systems of every kind: their essential purpose is to support human understanding and reasoning in deve...
Michael Jackson
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
14 years 9 months ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...