Sciweavers

1322 search results - page 127 / 265
» Parameterized counting problems
Sort
View
ISCA
1994
IEEE
80views Hardware» more  ISCA 1994»
14 years 2 months ago
A Study of Single-Chip Processor/Cache Organizations for Large Numbers of Transistors
This paper presents an examination of different cache and processor configurations assuming transistor densities will continue to increase as they have in the past. While in the s...
Matthew K. Farrens, Gary S. Tyson, Andrew R. Plesz...
CP
2006
Springer
14 years 1 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...
SIGMETRICS
2008
ACM
13 years 10 months ago
Long range mutual information
Network traffic modeling generally views traffic as a superposition of flows that creates a timeseries of volume counts (e.g. of bytes or packets). What is omitted from this view ...
Nahur Fonseca, Mark Crovella, Kavé Salamati...
PAMI
2007
196views more  PAMI 2007»
13 years 9 months ago
Bayesian Analysis of Lidar Signals with Multiple Returns
—Time-Correlated Single Photon Counting and Burst Illumination Laser data can be used for range profiling and target classification. In general, the problem is to analyze the res...
Sergio Hernandez-Marin, Andrew M. Wallace, Gavin J...
JMMA
2010
90views more  JMMA 2010»
13 years 4 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke