Sciweavers

1529 search results - page 113 / 306
» A slant removal algorithm
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
APLAS
2004
ACM
14 years 3 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
RT
1999
Springer
14 years 2 months ago
Interactive Virtual Relighting and Remodeling of Real Scenes
Abstract. Lighting design is often tedious due to the required physical manipulation of real light sources and objects. As an alternative, we present an interactive system to virtu...
Céline Loscos, Marie-Claude Frasson, George...
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
14 years 2 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
CRYPTO
2006
Springer
107views Cryptology» more  CRYPTO 2006»
14 years 2 months ago
Cryptanalysis of 2R- Schemes
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
Jean-Charles Faugère, Ludovic Perret