Sciweavers

1656 search results - page 70 / 332
» Labeling Schemes with Queries
Sort
View
COLING
2002
13 years 8 months ago
An Indexing Scheme for Typed Feature Structures
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature ...
Takashi Ninomiya, Takaki Makino, Jun-ichi Tsujii
ICDCS
2009
IEEE
14 years 6 months ago
Roadcast: A Popularity Aware Content Sharing Scheme in VANETs
Content sharing through vehicle-to-vehicle communication can help people find their interested content on the road. In VANETs, due to limited contact duration and unreliable wire...
Yang Zhang, Jing Zhao, Guohong Cao
FOCS
2007
IEEE
14 years 3 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
11 years 11 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
INFOCOM
2009
IEEE
14 years 3 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar