Sciweavers

2107 search results - page 124 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
BIRTHDAY
2006
Springer
15 years 10 months ago
Research Perspectives for Logic and Deduction
The article is meant to be kind of the author's manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a...
Wolfgang Bibel
CIKM
2008
Springer
15 years 8 months ago
A note on search based forecasting of ad volume in contextual advertising
In contextual advertising, estimating the number of impressions of an ad is critical in planning and budgeting advertising campaigns. However, producing this forecast, even within...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
HOTI
2005
IEEE
15 years 12 months ago
Long Round-Trip Time Support with Shared-Memory Crosspoint Buffered Packet Switch
— The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N2 ), where N is the number of port...
Ziqian Dong, Roberto Rojas-Cessa
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
16 years 11 days ago
Optimal Error Protection of Progressively Compressed 3D Meshes
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
Shakeel Ahmad, Raouf Hamzaoui