Sciweavers

2080 search results - page 80 / 416
» Measuring empirical computational complexity
Sort
View
LREC
2010
199views Education» more  LREC 2010»
13 years 11 months ago
A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José...
ECCC
2011
202views ECommerce» more  ECCC 2011»
13 years 5 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
MHCI
2004
Springer
14 years 3 months ago
Automatic Partitioning of Web Pages Using Clustering
This paper introduces a method for automatically partitioning richly-formatted electronic documents. An automatic partitioning system has many potential uses, but we focus here on ...
Richard Romero, Adam Berger
JVCIR
2006
140views more  JVCIR 2006»
13 years 10 months ago
Improved H.264 rate control by enhanced MAD-based frame complexity prediction
This paper presents a revised rate control scheme based on an improved frame complexity measure. Rate control adopted by both MPEG-4 VM18 and H.264/AVC use a quadratic rate-distor...
Xiaoquan Yi, Nam Ling
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 10 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...