Sciweavers

10289 search results - page 400 / 2058
» Standard bases in K
Sort
View
DAM
2010
137views more  DAM 2010»
15 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
ISCC
2000
IEEE
15 years 11 months ago
Light Weight Security for Parallel Access to Multiple Mirror Sites
Mirror sites approach has been proposed recently for reducing the access delay and providing load balancing in network servers. In the mirror site approach a file, such as a multi...
Bülent Yener
OPODIS
2008
15 years 8 months ago
On the Time-Complexity of Robust and Amnesic Storage
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
Dan Dobre, Matthias Majuntke, Neeraj Suri
KDD
2005
ACM
163views Data Mining» more  KDD 2005»
16 years 7 months ago
Data Sparsity Issues in the Collaborative Filtering Framework
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user effici...
Miha Grcar, Dunja Mladenic, Blaz Fortuna, Marko Gr...
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
16 years 4 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup