Sciweavers

1418 search results - page 159 / 284
» Schema polynomials and applications
Sort
View
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 6 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 3 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
16 years 21 days ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
CCS
2003
ACM
15 years 11 months ago
k-anonymous message transmission
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
Luis von Ahn, Andrew Bortz, Nicholas J. Hopper