Sciweavers

4908 search results - page 677 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
IJCV
2002
141views more  IJCV 2002»
15 years 6 months ago
Spatio-Temporal Stereo Using Multi-Resolution Subdivision Surfaces
We present a method to automatically extract spatio-temporal descriptions of moving objects from synchronized and calibrated multi-view sequences. The object is modeled by a time-...
Jan Neumann, Yiannis Aloimonos
CCR
1999
93views more  CCR 1999»
15 years 6 months ago
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell l...
Vincent Rosolen, Olivier Bonaventure, Guy Leduc
COMCOM
1999
87views more  COMCOM 1999»
15 years 6 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang
JASSS
1998
82views more  JASSS 1998»
15 years 6 months ago
Qualitative modeling and simulation of socio-economic phenomena
This paper describes an application of recently developed qualitative reasoning techniques to complex, socio{economic allocation problems. We explain why we believe traditional op...
Giorgio Brajnik, Marji Lines
PAMI
1998
127views more  PAMI 1998»
15 years 6 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho