Sciweavers

2693 search results - page 52 / 539
» On Computing Complex Navigation Functions
Sort
View
ASIACRYPT
2005
Springer
14 years 3 months ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz
CHI
1996
ACM
14 years 2 months ago
Silk from a Sow's Ear: Extracting Usable Structures from the Web
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
Peter Pirolli, James E. Pitkow, Ramana Rao
WISE
2010
Springer
13 years 7 months ago
The Ubiquitous DBMS
Advancement in mobile computing technologies has prompted strong needs for database systems that can be used in small devices such as sensors, cellular phones, PDAs, car navigator...
Kyu-Young Whang
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
ICASSP
2011
IEEE
13 years 1 months ago
Reduced complexity blind deterministic frequency offset estimation in OFDM systems
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
Hyoung-Goo Jeon, Kyoung-Soo Kim, Erchin Serpedin