Sciweavers

1537 search results - page 114 / 308
» On sets not belonging to algebras
Sort
View
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 7 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 6 months ago
Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
Florian Richoux
ICASSP
2011
IEEE
13 years 1 months ago
Closed-form expressions vs. BIC: A comparison for speaker clustering
In this paper, the use of closed-form expressions is compared to the BIC approximation, with respect to speaker clustering. We first show that the particular BIC setting which is...
Themos Stafylakis, Xavier Anguera Miró, Vas...
CHI
2009
ACM
14 years 10 months ago
Friend or foe?: examining CAS use in mathematics research
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
Andrea Bunt, Michael Terry, Edward Lank
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
14 years 10 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...