Sciweavers

2409 search results - page 345 / 482
» On Extended Regular Expressions
Sort
View
152
Voted
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
15 years 11 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
SMA
2003
ACM
169views Solid Modeling» more  SMA 2003»
15 years 10 months ago
Surface reconstruction of freeform objects based on multiresolution volumetric method
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
Sergei Azernikov, Alex Miropolsky, Anath Fischer
148
Voted
FPCA
1989
15 years 8 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
BMCBI
2007
158views more  BMCBI 2007»
15 years 4 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
139
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran