Sciweavers

12052 search results - page 2141 / 2411
» computer 2010
Sort
View
127
Voted
ASIACRYPT
2010
Springer
15 years 5 days ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
136
Voted
ICIP
2010
IEEE
15 years 21 days ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
137
Voted
CLEIEJ
2010
15 years 5 days ago
Logic Programming: Can the learning and teaching process be improved apart from standards adopted by most professors and establi
Logic programming is one of the most important subjects for students pursuing a degree in Information Technology and Communication (ITC) at higher education institutions. Teaching ...
Ricardo Luiz B. L. Campos
122
Voted
CLEIEJ
2010
15 years 5 days ago
A Query Language for Data Access in Ubiquitous Environments
Recent progress in ubiquitous computing technology is allowing development of new and sophisticated applications that are now able to store very large data on the mobile device it...
Cristiano Silveira, Leonardo Eloy, Jose Maria Mont...
106
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 days ago
Recognition of Non-Compound Handwritten Devnagari Characters using a Combination of MLP and Minimum Edit Distance
This paper deals with a new method for recognition of offline Handwritten noncompound Devnagari Characters in two stages. It uses two well known and established pattern recognitio...
Sandhya Arora, Debotosh Bhattacharjee, Mita Nasipu...
« Prev « First page 2141 / 2411 Last » Next »