Sciweavers

2714 search results - page 345 / 543
» Approximation Schemes for Scheduling
Sort
View
98
Voted
ICASSP
2010
IEEE
15 years 4 months ago
A union of incoherent spaces model for classification
We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data...
Karin Schnass, Pierre Vandergheynst
129
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
92
Voted
FGCS
2006
57views more  FGCS 2006»
15 years 3 months ago
On a solvability of contact problems with visco-plastic friction in the thermo-visco-plastic Bingham rheology
This paper deals with the solvability of contact problems with a local visco-plastic friction in the thermo-visco-plastic Bingham rheology. The generalized case of bodies of arbit...
Jirí Nedoma
IJNSEC
2006
132views more  IJNSEC 2006»
15 years 3 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
MOC
1998
126views more  MOC 1998»
15 years 3 months ago
Implicit-explicit multistep finite element methods for nonlinear parabolic problems
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...