Sciweavers

2631 search results - page 370 / 527
» Less is More
Sort
View
PODC
2010
ACM
15 years 7 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
SP
2010
IEEE
165views Security Privacy» more  SP 2010»
15 years 7 months ago
A Practical Attack to De-anonymize Social Network Users
—Social networking sites such as Facebook, LinkedIn, and Xing have been reporting exponential growth rates. These sites have millions of registered users, and they are interestin...
Gilbert Wondracek, Thorsten Holz, Engin Kirda, Chr...
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 7 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ALMOB
2007
74views more  ALMOB 2007»
15 years 4 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo
115
Voted
BMCBI
2010
103views more  BMCBI 2010»
15 years 4 months ago
MTRAP: Pairwise sequence alignment algorithm by a new measure based on transition probability between two consecutive pairs of r
Background: Sequence alignment is one of the most important techniques to analyze biological systems. It is also true that the alignment is not complete and we have to develop it ...
Toshihide Hara, Keiko Sato, Masanori Ohya