Sciweavers

3708 search results - page 258 / 742
» Approximating Betweenness Centrality
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
15 years 10 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
ISMIS
2000
Springer
15 years 10 months ago
Design of Rough Neurons: Rough Set Foundation and Petri Net Model
This paper introduces the design of rough neurons based on rough sets. Rough neurons instantiate approximate reasoning in assessing knowledge gleaned from input data. Each neuron c...
James F. Peters, Andrzej Skowron, Zbigniew Suraj, ...
SGP
2004
15 years 9 months ago
Signal-Specialized Parameterization for Piecewise Linear Reconstruction
We propose a metric for surface parameterization specialized to its signal that can be used to create more efficient, high-quality texture maps. Derived from Taylor expansion of s...
Geetika Tewari, John Snyder, Pedro V. Sander, Stev...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
15 years 8 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...