Sciweavers

2432 search results - page 478 / 487
» Degrees and choice numbers
Sort
View
TKDE
1998
139views more  TKDE 1998»
13 years 7 months ago
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
Alexander Thomasian
TNN
1998
125views more  TNN 1998»
13 years 7 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
TIT
2002
126views more  TIT 2002»
13 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
COMCOM
2008
135views more  COMCOM 2008»
13 years 7 months ago
Peer-to-peer system-based active worm attacks: Modeling, analysis and defense
Active worms continue to pose major threats to the security of today's Internet. This is due to the ability of active worms to automatically propagate themselves and compromi...
Wei Yu, Sriram Chellappan, Xun Wang, Dong Xuan
MST
2007
167views more  MST 2007»
13 years 6 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...