Sciweavers

16504 search results - page 3006 / 3301
» New Problems, New Solutions
Sort
View
PODC
2006
ACM
16 years 22 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
16 years 12 days ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
AIRWEB
2005
Springer
16 years 9 days ago
Web Spam, Propaganda and Trust
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. ...
Panagiotis Takis Metaxas, Joseph DeStefano
ASIACRYPT
2005
Springer
16 years 9 days ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
16 years 9 days ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
« Prev « First page 3006 / 3301 Last » Next »