5606 search results - page 399 / 1122 » Randomization Techniques for Graphs. |
174
click to vote
INFOVIS
2005
IEEE
16 years 9 days ago
2005
IEEE
We introduce Tukey and Tukey scagnostics and develop graphtheoretic methods for implementing their procedure on large datasets. CR Categories: H.5.2 [User Interfaces]: Graphical U...
150
click to vote
ATMOS
2008
15 years 8 months ago
2008
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...
132
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
196
Voted
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
191
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...