Sciweavers

11160 search results - page 139 / 2232
» Incompleteness in a General Setting
Sort
View
198
Voted
LCPC
2005
Springer
15 years 6 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi
83
Voted
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 4 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
ACL
2008
15 years 2 months ago
Generalized Expectation Criteria for Semi-Supervised Learning of Conditional Random Fields
This paper presents a semi-supervised training method for linear-chain conditional random fields that makes use of labeled features rather than labeled instances. This is accompli...
Gideon S. Mann, Andrew McCallum
87
Voted
NIPS
2007
15 years 2 months ago
A general agnostic active learning algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
Sanjoy Dasgupta, Daniel Hsu, Claire Monteleoni
100
Voted
SIS
2007
15 years 2 months ago
A General Approach to Securely Querying XML
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...