Sciweavers

1548 search results - page 75 / 310
» Computational Approaches to Sentence Completion
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 7 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
160
Voted
CGF
2006
128views more  CGF 2006»
15 years 6 months ago
Computing discrete shape operators on general meshes
Discrete curvature and shape operators, which capture complete information about directional curvatures at a point, are essential in a variety of applications: simulation of defor...
Eitan Grinspun, Yotam I. Gingold, Jason Reisman, D...
176
Voted
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
16 years 27 days ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
170
Voted
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
15 years 10 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
JNW
2008
101views more  JNW 2008»
15 years 6 months ago
Computational Time-Division and Code-Division Channel Access Scheduling in Ad Hoc Networks
Using two-hop neighborhood information, we present the hybrid activation multiple access (HAMA) protocol for time-division channel access scheduling in ad hoc networks with omni-di...
Lichun Bao, J. J. Garcia-Luna-Aceves