Sciweavers

2621 search results - page 256 / 525
» Near orders and codes
Sort
View
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
TC
1998
15 years 6 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç
IJLT
2010
115views more  IJLT 2010»
15 years 5 months ago
Computer supported ubiquitous learning environment for vocabulary learning
: Ubiquitous computing could help the organisation and the mediation of social interactions wherever and whenever these situations might occur. Using those technologies enables the...
Hiroaki Ogata, Chengjiu Yin, Moushir M. El-Bishout...
INFOCOM
2010
IEEE
15 years 5 months ago
Retiring Replicants: Congestion Control for Intermittently-Connected Networks
Abstract—The widespread availability of mobile wireless devices offers growing opportunities for the formation of temporary networks with only intermittent connectivity. These in...
Nathanael Thompson, Samuel C. Nelson, Mehedi Bakht...
ACL
2010
15 years 4 months ago
Profiting from Mark-Up: Hyper-Text Annotations for Guided Parsing
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
Valentin I. Spitkovsky, Daniel Jurafsky, Hiyan Als...